Emerging in the early 1960s , the genetic algorithm and evolutionary algorithms in general took a place in computer science between deterministic and non - deterministic algorithms 遗传算法(以及普遍意义上的进化算法)出现在20世纪60年代早期,并在计算机科学的确定性和非确定性算法之间占据了一席之位。
In computer science, a deterministic algorithm is an algorithm which, given a particular input, will always produce the same output, with the underlying machine always passing through the same sequence of states. Deterministic algorithms are by far the most studied and familiar kind of algorithm, as well as one of the most practical, since they can be run on real machines efficiently.